Strain and grain connectivity in Bi2223/Ag superconducting tapes

The critical current reduction in silver-sheathed (Bi,Pb)2 Sr2Ca2Cu3O10 superconducting tapes (Bi2223/Ag) is investigated when loaded with uni-axial strains in combination with a magnetic field perpendicular to the tape surface. The number and quality of the grain-to-grain connections and the alignment of the superconducting cores mainly determine the critical current in Bi2223/Ag tapes. It is assumed that the transport current flows simultaneously through two current carrying paths in the tape: one through the network of Josephson junctions and the other is through the well-connected grains. The model describes well the magnetic field dependence of the critical current at various strains. A detailed analysis has shown that strain deteriorates grain connectivity, induces cracking and hence changes the current carrying path. Furthermore, strain may introduce new defects inside the grains along the strong-link current path and increase intra-granular pinning strengt

Property-preserving subnet reductions for designing manufacturing systems with shared resources

AbstractThis paper handles two problems in manufacturing system design: resource sharing and system abstraction. In a manufacturing system, resources such as robots, machines, etc. are shared by several processes. When the resources are switched from one process to another, they may need some modifications such as cleaning oil, adding equipments and so on. Previous designing methods assume that the resources have no intermediate modifications. Hence, they need to be extended to handle such kinds of resource-sharing problems. As for abstraction, modeling operations with single places in manufacturing system design is very popular. From the viewpoint of verification, the objective is to verify whether the reduced model has the same desirable properties as the original one. This paper presents three kinds of property-preserving subnet reduction methods. For each reduction method, conditions are presented for ensuring that the properties liveness, boundedness and reversibility are preserved. Applications of these reduction methods to handling the above resource sharing and system abstraction problems are illustrated with an example from the manufacturing system

Glycosylation pattern of brush border-associated glycoproteins in enterocyte-like cells: involvement of complex-type N-glycans in apical trafficking

We have previously reported that galectin-4, a tandem repeat-type galectin, regulates the raft-dependent delivery of glycoproteins to the apical brush border membrane of enterocyte-like HT-29 cells. N-Acetyllactosamine-containing glycans, known as galectin ligands, were found enriched in detergent-resistant membranes. Here, we analyzed the potential contribution of N-and/ or O-glycans in this mechanism. Structural studies were carried out on the brush border membrane-enriched fraction using matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF-MS) and nano-ESI-QTOF-MS/MS. The pattern of N-glycans was very heterogeneous, with the presence of high mannose- and hybrid-type glycans as well as a multitude of complex-type glycans. In contrast, the pattern of O-glycans was very simple with the presence of two major core type 1 O-glycans, sialylated and bisialylated T-antigen structures {[}Neu5Ac alpha 2-3Gal beta 1-3GalNAc-ol and Neu5Ac alpha 2-3Gal beta 1 -3(Neu5Ac alpha 2-6)GalNAc-ol]. Thus, N-glycans rather than O-glycans contain the N-acetyllactosamine recognition signals for the lipid raft-based galectin-4-dependent apical delivery. In the presence of 1-deoxymannojirimycin, a drug which inhibits the generation of hybrid-type or complex type N-glycans, the extensively O-glycosylated mucin-like MUC1 glycoprotein was not delivered to the apical brush border but accumulated inside the cells. Altogether, our data demonstrate the crucial role of complex N-glycans in the galectin-4-dependent delivery of glycoproteins to the apical brush border membrane of enterocytic HT-29 cells

EFFECTS OF CONCENTRIC VERSUS ECCENTRIC TRAINING ON MUSCLE STRENGTH AND NEUROMUSCULAR ACTIVATION

Eccentric contraction (EC) involves fewer motor units but produces more tension than concentric contraction (CC) (Kay, 2000). Both EC and CC training can stimulate strength gain (Miller, 2006). However, it is not clear whether one method is more effective than the other and the effect of each training on motor units recruited after training. The purpose of this study was to compare the effects of EC and CC isokinetic training exercises on quadriceps muscle strength and neuromuscular activations

DIFFERENCES BETWEEN CONCENTRIC AND ECCENTRIC CONTRACTION INDUCED MUSCLE FATIGUE

Studies of neuromuscular activation often evaluated through isometric contractions. However, this type of contraction may not truly represent muscle actions during activities. EMG analysis is not only used to determine motor unit activations, but also used to determine muscle conduction velocity by transforming signals into frequency spectrum. Studies have shown that fatigue mucles produced a relativly slower conduction velocity measured by mean power frequency (MPF). Therefore, the purpose of this study was to compare the effects of muscle fatigue generated by two different types of contraction. We hypothesized that muscle fatigue generated by concentric contractions (CC) would cause gretaer muscle contraction frequency reduction than eccentric contractions (EC)

Critical Susceptibility Exponent Measured from Fe/W(110) Bilayers

The critical phase transition in ferromagnetic ultrathin Fe/W(110) films has been studied using the magnetic ac susceptibility. A statistically objective, unconstrained fitting of the susceptibility is used to extract values for the critical exponent (gamma), the critical temperature Tc, the critical amplitude (chi_o) and the range of temperature that exhibits power-law behaviour. A fitting algorithm was used to simultaneously minimize the statistical variance of a power law fit to individual experimental measurements of chi(T). This avoids systematic errors and generates objective fitting results. An ensemble of 25 measurements on many different films are analyzed. Those which permit an extended fitting range in reduced temperature lower than approximately .00475 give an average value gamma=1.76+-0.01. Bilayer films give a weighted average value of gamma = 1.75+-0.02. These results are in agreement with the -dimensional Ising exponent gamma= 7/4. Measurements that do not exhibit power-law scaling as close to Tc (especially films of thickness 1.75ML) show a value of gamma higher than the Ising value. Several possibilities are considered to account for this behaviour.Comment: -Submitted to Phys. Rev. B -Revtex4 Format -6 postscript figure

Blowup Criterion for the Compressible Flows with Vacuum States

We prove that the maximum norm of the deformation tensor of velocity gradients controls the possible breakdown of smooth(strong) solutions for the 3-dimensional compressible Navier-Stokes equations, which will happen, for example, if the initial density is compactly supported \cite{X1}. More precisely, if a solution of the compressible Navier-Stokes equations is initially regular and loses its regularity at some later time, then the loss of regularity implies the growth without bound of the deformation tensor as the critical time approaches. Our result is the same as Ponce's criterion for 3-dimensional incompressible Euler equations (\cite{po}). Moreover, our method can be generalized to the full Compressible Navier-Stokes system which improve the previous results. In addition, initial vacuum states are allowed in our cases.Comment: 17 page

Image tag completion by local learning

The problem of tag completion is to learn the missing tags of an image. In this paper, we propose to learn a tag scoring vector for each image by local linear learning. A local linear function is used in the neighborhood of each image to predict the tag scoring vectors of its neighboring images. We construct a unified objective function for the learning of both tag scoring vectors and local linear function parame- ters. In the objective, we impose the learned tag scoring vectors to be consistent with the known associations to the tags of each image, and also minimize the prediction error of each local linear function, while reducing the complexity of each local function. The objective function is optimized by an alternate optimization strategy and gradient descent methods in an iterative algorithm. We compare the proposed algorithm against different state-of-the-art tag completion methods, and the results show its advantages

Pion Form Factors in Holographic QCD

Using a holographic dual model of QCD, we compute the pion electromagnetic form factor F_pi(Q^2) in the spacelike momentum transfer region, as well as pion couplings to vector mesons g_rho^(n) pi pi. Spontaneous and explicit chiral symmetry breaking are intrinsic features of this particular holographic model. We consider variants with both ``hard-wall'' and ``soft-wall'' infrared cutoffs, and find that the F_pi(Q^2) data tend to lie closer to the hard-wall model predictions, although both are too shallow for large Q^2. By allowing the parameters of the soft-wall model (originally fixed by observables such as m_rho) to vary, one finds fits that tend to agree better with F_pi(Q^2). We also compute the pion charge radius for a variety of parameter choices, and use the values of f^(n)_rho, g_{rho^(n) pi pi} and m^(n)_rho to observe the saturation of F_pi(0) by rho poles.Comment: 17 pages, 2 figures, revised fits using consistent normalization of f_pi. References update

Complexity of Coloring Graphs without Paths and Cycles

Let $P_t$ and $C_\ell$ denote a path on $t$ vertices and a cycle on $\ell$ vertices, respectively. In this paper we study the $k$-coloring problem for $(P_t,C_\ell)$-free graphs. Maffray and Morel, and Bruce, Hoang and Sawada, have proved that 3-colorability of $P_5$-free graphs has a finite forbidden induced subgraphs characterization, while Hoang, Moore, Recoskie, Sawada, and Vatshelle have shown that $k$-colorability of $P_5$-free graphs for $k \geq 4$ does not. These authors have also shown, aided by a computer search, that 4-colorability of $(P_5,C_5)$-free graphs does have a finite forbidden induced subgraph characterization. We prove that for any $k$, the $k$-colorability of $(P_6,C_4)$-free graphs has a finite forbidden induced subgraph characterization. We provide the full lists of forbidden induced subgraphs for $k=3$ and $k=4$. As an application, we obtain certifying polynomial time algorithms for 3-coloring and 4-coloring $(P_6,C_4)$-free graphs. (Polynomial time algorithms have been previously obtained by Golovach, Paulusma, and Song, but those algorithms are not certifying); To complement these results we show that in most other cases the $k$-coloring problem for $(P_t,C_\ell)$-free graphs is NP-complete. Specifically, for $\ell=5$ we show that $k$-coloring is NP-complete for $(P_t,C_5)$-free graphs when $k \ge 4$ and $t \ge 7$; for $\ell \ge 6$ we show that $k$-coloring is NP-complete for $(P_t,C_\ell)$-free graphs when $k \ge 5$, $t \ge 6$; and additionally, for $\ell=7$, we show that $k$-coloring is also NP-complete for $(P_t,C_7)$-free graphs if $k = 4$ and $t\ge 9$. This is the first systematic study of the complexity of the $k$-coloring problem for $(P_t,C_\ell)$-free graphs. We almost completely classify the complexity for the cases when $k \geq 4, \ell \geq 4$, and identify the last three open cases